A Fast Algorithm for Matrix-Valued Nevanlinna-Pick Interpolation
نویسندگان
چکیده
In this paper, we derive a new fast algorithm for the matrixvalued Nevanlinna-Pick interpolation. Given n distinct points zi in the unit disk jzj < 1 and n complex matrices Wk of dimension m m, satisfying the Pick condition for 1 k n, the new Nevanlinna-Pick interpolation algorithm requires only 20 3 nm 3 complex arithmetic operations to evaluate the matrix-valued interpolatory rational function at any particular value of z, in contrast to the recently proposed algorithm which requires approximately 95nm arithmetic operations.
منابع مشابه
Nevanlinna - Pick Interpolation For
We study the Nevanlinna-Pick problem for a class of subalgebras of H∞. This class includes algebras of analytic functions on embedded disks, the algebras of finite codimension in H∞ and the algebra of bounded analytic functions on a multiply connected domain. Our approach uses a distance formula that generalizes Sarason’s [18] work. We also investigate the difference between scalar-valued and m...
متن کاملComplete Nevanlinna-Pick Kernels
We give a new treatment of Quiggin’s and McCullough’s characterization of complete Nevanlinna-Pick kernels. We show that a kernel has the matrix-valued NevanlinnaPick property if and only if it has the vector-valued Nevanlinna-Pick property. We give a representation of all complete Nevanlinna-Pick kernels, and show that they are all restrictions of a universal complete Nevanlinna-Pick kernel.
متن کاملA Constrained Nevanlinna-pick Interpolation Problem for Matrix-valued Functions
Recent results of Davidson-Paulsen-Raghupathi-Singh give necessary and sufficient conditions for the existence of a solution to the NevanlinnaPick interpolation problem on the unit disk with the additional restriction that the interpolant should have the value of its derivative at the origin equal to zero. This concrete mild generalization of the classical problem is prototypical of a number of...
متن کاملA Superfast Algorithm for Confluent Rational Tangential Interpolation Problem via Matrix-vector Multiplication for Confluent Cauchy-like Matrices∗
Various problems in pure and applied mathematics and engineering can be reformulated as linear algebra problems involving dense structured matrices. The structure of these dense matrices is understood in the sense that their n2 entries can be completeley described by a smaller number O(n) of parameters. Manipulating directly on these parameters allows us to design efficient fast algorithms. One...
متن کاملA Unified Superfast Algorithm for Boundary Rational Tangential Interpolation Problems and for Inversion and Factorization of Dense Structured Matrices
The classical scalar Nevanlinna-Pick interpolation problem has a long and distinguished history, appearing in a variety of applications in mathematics and electrical engineering. There is a vast literature on this problem and on its various far reaching generalizations; for a quick historical survey see [1] and [38]. It is widely known that the now classical algorithm for solving this problem p...
متن کامل